Perfect hashing as an almost perfect subtype test
نویسندگان
چکیده
منابع مشابه
Subgame Perfect Implementation under Perfect and Almost Perfect Information: An Empirical Test
In this paper we conduct a laboratory experiment to test the extent to which Moore and Repullo’s subgame perfect implementation mechanism induces truth-telling in practice, both in a setting with perfect information and in a setting where buyers and sellers face a small amount of uncertainty regarding the good’s value. We find that Moore-Repullo mechanisms fail to implement truth-telling in a s...
متن کاملUniversal Hashing and Perfect Hashing
Each of the key values x comes from a universe U , i.e. x ∈ U . In this document, we assume U = {1, 2, . . . N}. Observe that the set S is a dynamic set. Each of the Insert and Delete operations may modify the set. Hence the size of the set S changes with each operation. We bound the maximum size of the set to n (n << N). What are the data structures that can be used to store the set S? One opt...
متن کاملSubgame Perfect Implementation With Almost Perfect Information
The theory of incomplete contracts has been recently questioned using or extending the subgame perfect implementation approach of Moore and Repullo (1988). We consider the robustness of this mechanism to the introduction of small amounts of asymmetric information. Our main result is that the mechanism may not yield (even approximately) truthful revelation as the amount of asymmetric information...
متن کاملPerfect Consistent Hashing
Consistent Hashing functions are widely used for load balancing across a variety of applications. However, the original presentation and typical implementations of Consistent Hashing rely on randomised allocation of hash codes to keys which results in a flawed and approximately-uniform allocation of keys to hash codes. We analyse the desired properties and present an algorithm that perfectly ac...
متن کاملPractical Perfect Hashing
A practical method is presented that permits retrieval from a table in constant time. The method is suitable for large tables and consumes, in practice, O(n) space for n table elements. In addition, the table and the hashing function can be constructed in O(n) expected time. Variations of the method that offer different compromises between storage usage and update time are presented.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM Transactions on Programming Languages and Systems
سال: 2008
ISSN: 0164-0925,1558-4593
DOI: 10.1145/1391956.1391960